منابع مشابه
Hyperbolic Structures on Branched Covers over Hyperbolic Links
Using a result of Tian concerning deformation of negatively curved metrics to Einstein metrics, we conclude that, for any fixed link with hyperbolic complement, there is a class of irregular branched covering spaces, branched over that link, effectively detectable by their branching indices, which consists entirely of closed hyperbolic manifolds. Section 0 Introduction. One of the elusive compo...
متن کاملGeometric Structures on Branched Covers over Universal Links
A number of recent results are presented which bear on the question of what geometric information can be gleaned from the representation of a three-manifold as a branched cover over a fixed universal link. Results about Seifert-fibered manifolds, graph manifolds and hyperbolic manifolds are discussed. Section 0 Introduction. Closed, orientable three-manifolds admit a variety of universal constr...
متن کاملConstructing Simplicial Branched Covers
Izmestiev and Joswig described how to obtain a simplicial covering space (the partial unfolding) of a given simplicial complex, thus obtaining a simplicial branched cover [Adv. Geom. 3(2):191-255, 2003]. We present a large class of branched covers which can be constructed via the partial unfolding. In particular, for d ≤ 4 every closed oriented PL d-manifold is the partial unfolding of some pol...
متن کاملBranched Spines and Contact Structures on 3-manifolds
The study of the characteristic foliation induced on an embedded surface is one of the main themes in 3-dimensional contact topology. In particular (see [10]) one can describe exactly what foliations arise (“existence results”). Moreover one knows that the characteristic foliation F = Fξ(Σ) determines uniquely the contact structure ξ in a neighbourhood of a surface Σ (“uniqueness results”). (By...
متن کاملPolynomial Root-Finding Algorithms and Branched Covers
Introduction. The problem of devising optimal methods for numerically approximating the roots of a polynomial has been of interest for several centuries, and is far from solved. There are numerous recent works on root-finding algorithms and their cost, for example, the work of Jenkins and Traub [JT70], Renegar [Ren87], Schönhage [Sch82], and Shub and Smale [SS85, SS86, Sma85]. This list is far ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1987
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1987-0902554-9